Fractal Traffic: Measurements, Modelling and Performance Evaluation - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
نویسندگان
چکیده
Observations of both Ethernet traffic and variable bit rate (VBR) video traffic have demonstrated that these traffics exhibit “self-similarity” and/or infinit l e asymptotic index of dispersion for counts (IDC). We report here on measurements of traffic an a commercialpublic broadband network where similar characteristics have been observed. For the purpose of analysis and dimensioning of the central links of an ATM network we analyse in this paper the performance of a single server queue f e d b y Gaussian trafic with infjlnite IDC. The analysis leads t o an approximation fo,r the performance of a queue in which the arriving trafic is “fractal” Gaussian and consequently where there does not exist a dominant negative-exponential tail. The term ufractal” is used here in the sense thtzt the autocovariance of the traffic exhibits self-similarity, that is to say, where the autocovariance of an aggregate of the trafic is the same, or asymptotically the same for large time lags, as the original traffic. We are not concerned with proving or exploiting this self-similarity property as such, but only with performancle analysis techniques which are effective for such processes. In order to be able to test the performance analysis formulae, we show that trafic with the same arutocovaria w e as measured an a real network over a wide range of lags (sufficiently wide a range for the traffic to be equivalent from the point of view of queueing performance) can be generated as a mixture of two Gaussian AR(1) processes. In this way we demonstrate that the analytic performance formulae are accurate.
منابع مشابه
The Use of Communications Networks to Increase Personal Privacy - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
Communications Networks can separate as well as join iMormation. This ability can be used to increase personal privacy in an environment where advances in technology makes it possible to collect and correlate increasing amounts of information about individuals. The tools and principles necessary to increase personal privacy are demonstrated by creating an anonymous credit card, in which a perso...
متن کاملComputing approximate blocking probabilities for a class of all-optical networks - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength o n that path. Moreover, o n the links of that path n o other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabil...
متن کاملDocument Marking and Identification using Both Line and Word Shifting - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We continue our study of document marking t o deter illicit dissemination. A n experiment we performed reveals that the distortion on the photocopy of a document is very different in the vertical and horizontal directions. This leads to the strategy that marks a text line both vertically using line shifting and horizontally using word shifting. A line that is marked is always accompanied by two...
متن کاملResource Allocation in a Multicast Tree - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth resewed at the link by all receivers using that link We formulate and solve a problem of a...
متن کاملAn Enhanced Random Early Marking Algorithm for Internet Flow Control - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
AbstructWe propose earlier an optimization based flow control for the Internet called Random Early Mark@ (REM). In this paper we propose and evaluate an enhancement that attempts to sped up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995